./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/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_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:49:50,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:49:50,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:49:50,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:49:50,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:49:50,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:49:50,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:49:50,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:49:50,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:49:50,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:49:50,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:49:50,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:49:50,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:49:50,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:49:50,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:49:50,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:49:50,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:49:50,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:49:50,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:49:50,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:49:50,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:49:50,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:49:50,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:49:50,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:49:50,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:49:50,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:49:50,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:49:50,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:49:50,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:49:50,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:49:50,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:49:50,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:49:50,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:49:50,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:49:50,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:49:50,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:49:50,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:49:50,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:49:50,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:49:50,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:49:50,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:49:50,380 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-18 20:49:50,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:49:50,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:49:50,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:49:50,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:49:50,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:49:50,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:49:50,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:49:50,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:49:50,426 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:49:50,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:49:50,427 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:49:50,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:49:50,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:49:50,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:49:50,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:49:50,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:49:50,429 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:49:50,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:49:50,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:49:50,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:49:50,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:49:50,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:49:50,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:49:50,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:49:50,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:49:50,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:49:50,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:49:50,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:49:50,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:49:50,433 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:49:50,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:49:50,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:49:50,434 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_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/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_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro 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-18 20:49:50,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:49:50,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:49:50,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:49:50,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:49:50,837 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:49:50,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/../../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-18 20:49:50,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/data/9d8f2773c/4992201f3c904a699a20e6a5e809d842/FLAG505a7d84f [2022-11-18 20:49:51,588 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:49:51,589 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/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-18 20:49:51,606 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/data/9d8f2773c/4992201f3c904a699a20e6a5e809d842/FLAG505a7d84f [2022-11-18 20:49:51,854 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/data/9d8f2773c/4992201f3c904a699a20e6a5e809d842 [2022-11-18 20:49:51,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:49:51,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:49:51,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:49:51,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:49:51,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:49:51,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:51" (1/1) ... [2022-11-18 20:49:51,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517723f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:51, skipping insertion in model container [2022-11-18 20:49:51,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:51" (1/1) ... [2022-11-18 20:49:51,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:49:51,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:49:52,457 WARN L234 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_3e9169a0-8b3c-459b-8fd6-c81a3312397e/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-18 20:49:52,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:49:52,648 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:49:52,729 WARN L234 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_3e9169a0-8b3c-459b-8fd6-c81a3312397e/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-18 20:49:52,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:49:52,858 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:49:52,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52 WrapperNode [2022-11-18 20:49:52,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:49:52,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:49:52,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:49:52,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:49:52,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:52,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:52,989 INFO L138 Inliner]: procedures = 78, calls = 165, calls flagged for inlining = 30, calls inlined = 26, statements flattened = 521 [2022-11-18 20:49:52,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:49:52,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:49:52,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:49:52,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:49:53,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,040 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:49:53,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:49:53,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:49:53,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:49:53,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (1/1) ... [2022-11-18 20:49:53,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:49:53,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:53,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:49:53,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:49:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-11-18 20:49:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-11-18 20:49:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:49:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:49:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:49:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:49:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:49:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:49:53,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:49:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-11-18 20:49:53,172 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-11-18 20:49:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-18 20:49:53,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-18 20:49:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:49:53,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:49:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-11-18 20:49:53,175 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-11-18 20:49:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:49:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:49:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-11-18 20:49:53,176 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-11-18 20:49:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-18 20:49:53,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-18 20:49:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-11-18 20:49:53,177 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-11-18 20:49:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:49:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 20:49:53,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 20:49:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-11-18 20:49:53,178 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-11-18 20:49:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:49:53,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:49:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:49:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:49:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-18 20:49:53,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-18 20:49:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-18 20:49:53,180 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-18 20:49:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:49:53,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:49:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-18 20:49:53,181 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-18 20:49:53,445 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:49:53,457 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:49:53,596 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 20:49:54,407 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:49:54,417 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:49:54,418 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:49:54,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:54 BoogieIcfgContainer [2022-11-18 20:49:54,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:49:54,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:49:54,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:49:54,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:49:54,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:49:51" (1/3) ... [2022-11-18 20:49:54,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1639929a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:49:54, skipping insertion in model container [2022-11-18 20:49:54,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:52" (2/3) ... [2022-11-18 20:49:54,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1639929a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:49:54, skipping insertion in model container [2022-11-18 20:49:54,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:54" (3/3) ... [2022-11-18 20:49:54,437 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-11-18 20:49:54,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:49:54,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-18 20:49:54,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:49:54,557 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;@1b07ba11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:49:54,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-18 20:49:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 163 states have internal predecessors, (196), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-18 20:49:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:49:54,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:54,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:49:54,576 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-18 20:49:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:54,583 INFO L85 PathProgramCache]: Analyzing trace with hash 40388831, now seen corresponding path program 1 times [2022-11-18 20:49:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:54,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253941524] [2022-11-18 20:49:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:55,014 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-18 20:49:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:55,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253941524] [2022-11-18 20:49:55,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253941524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:55,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:55,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:49:55,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162352783] [2022-11-18 20:49:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:55,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:49:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:49:55,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:49:55,084 INFO L87 Difference]: Start difference. First operand has 207 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 163 states have internal predecessors, (196), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:49:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:55,274 INFO L93 Difference]: Finished difference Result 436 states and 568 transitions. [2022-11-18 20:49:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:49:55,283 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-18 20:49:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:55,302 INFO L225 Difference]: With dead ends: 436 [2022-11-18 20:49:55,303 INFO L226 Difference]: Without dead ends: 209 [2022-11-18 20:49:55,313 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-18 20:49:55,355 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 35 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:55,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 501 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:49:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-18 20:49:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-11-18 20:49:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 166 states have internal predecessors, (204), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:49:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 264 transitions. [2022-11-18 20:49:55,483 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 264 transitions. Word has length 12 [2022-11-18 20:49:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:55,484 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 264 transitions. [2022-11-18 20:49:55,484 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-18 20:49:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 264 transitions. [2022-11-18 20:49:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 20:49:55,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:55,487 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-18 20:49:55,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:49:55,488 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-18 20:49:55,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1751225976, now seen corresponding path program 1 times [2022-11-18 20:49:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:55,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398219621] [2022-11-18 20:49:55,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:55,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:49:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:55,849 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-18 20:49:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:55,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398219621] [2022-11-18 20:49:55,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398219621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:55,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:55,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:49:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895967295] [2022-11-18 20:49:55,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:55,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:49:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:55,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:49:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:49:55,860 INFO L87 Difference]: Start difference. First operand 209 states and 264 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:49:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:56,748 INFO L93 Difference]: Finished difference Result 635 states and 806 transitions. [2022-11-18 20:49:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:49:56,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-18 20:49:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:56,761 INFO L225 Difference]: With dead ends: 635 [2022-11-18 20:49:56,762 INFO L226 Difference]: Without dead ends: 429 [2022-11-18 20:49:56,764 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-18 20:49:56,766 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 317 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:56,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 799 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:49:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-11-18 20:49:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 211. [2022-11-18 20:49:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 168 states have internal predecessors, (206), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:49:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 266 transitions. [2022-11-18 20:49:56,813 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 266 transitions. Word has length 30 [2022-11-18 20:49:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:56,813 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 266 transitions. [2022-11-18 20:49:56,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:49:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 266 transitions. [2022-11-18 20:49:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 20:49:56,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:56,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:49:56,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:49:56,833 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-18 20:49:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1454789785, now seen corresponding path program 1 times [2022-11-18 20:49:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:56,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886038394] [2022-11-18 20:49:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:49:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:49:56,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:56,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886038394] [2022-11-18 20:49:56,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886038394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:56,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:56,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:49:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382196493] [2022-11-18 20:49:56,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:56,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:49:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:49:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:49:56,981 INFO L87 Difference]: Start difference. First operand 211 states and 266 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:49:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:57,743 INFO L93 Difference]: Finished difference Result 640 states and 811 transitions. [2022-11-18 20:49:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:49:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-11-18 20:49:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:57,747 INFO L225 Difference]: With dead ends: 640 [2022-11-18 20:49:57,748 INFO L226 Difference]: Without dead ends: 432 [2022-11-18 20:49:57,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:49:57,750 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 317 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:57,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 799 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:49:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-18 20:49:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 211. [2022-11-18 20:49:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 168 states have internal predecessors, (206), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-18 20:49:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 266 transitions. [2022-11-18 20:49:57,779 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 266 transitions. Word has length 38 [2022-11-18 20:49:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:57,779 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 266 transitions. [2022-11-18 20:49:57,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:49:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 266 transitions. [2022-11-18 20:49:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:49:57,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:57,783 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-18 20:49:57,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:49:57,784 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-18 20:49:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash 305024916, now seen corresponding path program 1 times [2022-11-18 20:49:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:57,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134805629] [2022-11-18 20:49:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:49:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:49:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:49:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:49:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,968 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-18 20:49:57,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:57,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134805629] [2022-11-18 20:49:57,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134805629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:57,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:57,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:49:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404635753] [2022-11-18 20:49:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:57,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:49:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:57,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:49:57,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:49:57,972 INFO L87 Difference]: Start difference. First operand 211 states and 266 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-18 20:49:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:58,528 INFO L93 Difference]: Finished difference Result 485 states and 607 transitions. [2022-11-18 20:49:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:49:58,530 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-18 20:49:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:58,538 INFO L225 Difference]: With dead ends: 485 [2022-11-18 20:49:58,539 INFO L226 Difference]: Without dead ends: 277 [2022-11-18 20:49:58,540 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-18 20:49:58,541 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 225 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:58,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 572 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:49:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-18 20:49:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2022-11-18 20:49:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 197 states have (on average 1.3147208121827412) internal successors, (259), 211 states have internal predecessors, (259), 35 states have call successors, (35), 21 states have call predecessors, (35), 21 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-18 20:49:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 329 transitions. [2022-11-18 20:49:58,579 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 329 transitions. Word has length 58 [2022-11-18 20:49:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:58,580 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 329 transitions. [2022-11-18 20:49:58,580 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-18 20:49:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 329 transitions. [2022-11-18 20:49:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-18 20:49:58,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:58,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:49:58,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:49:58,584 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-18 20:49:58,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 756150245, now seen corresponding path program 1 times [2022-11-18 20:49:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:58,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882124589] [2022-11-18 20:49:58,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:58,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:49:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:58,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:49:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:49:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:49:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:49:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:58,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882124589] [2022-11-18 20:49:58,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882124589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:58,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:58,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:49:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865537116] [2022-11-18 20:49:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:58,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:49:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:49:58,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:49:58,813 INFO L87 Difference]: Start difference. First operand 267 states and 329 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-18 20:49:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:59,559 INFO L93 Difference]: Finished difference Result 464 states and 576 transitions. [2022-11-18 20:49:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:49:59,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2022-11-18 20:49:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:59,564 INFO L225 Difference]: With dead ends: 464 [2022-11-18 20:49:59,565 INFO L226 Difference]: Without dead ends: 462 [2022-11-18 20:49:59,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:49:59,567 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 220 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:59,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 621 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:49:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-18 20:49:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 440. [2022-11-18 20:49:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 334 states have (on average 1.311377245508982) internal successors, (438), 349 states have internal predecessors, (438), 59 states have call successors, (59), 33 states have call predecessors, (59), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-11-18 20:49:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 556 transitions. [2022-11-18 20:49:59,626 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 556 transitions. Word has length 67 [2022-11-18 20:49:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:59,627 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 556 transitions. [2022-11-18 20:49:59,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-18 20:49:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 556 transitions. [2022-11-18 20:49:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-18 20:49:59,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:59,632 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-18 20:49:59,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:49:59,632 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-18 20:49:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1424541863, now seen corresponding path program 1 times [2022-11-18 20:49:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:59,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141364565] [2022-11-18 20:49:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:49:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:49:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:49:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-18 20:49:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:49:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:49:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,839 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-18 20:49:59,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:59,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141364565] [2022-11-18 20:49:59,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141364565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:59,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:59,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:49:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445081824] [2022-11-18 20:49:59,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:59,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:49:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:49:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:49:59,842 INFO L87 Difference]: Start difference. First operand 440 states and 556 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-18 20:50:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:00,438 INFO L93 Difference]: Finished difference Result 922 states and 1181 transitions. [2022-11-18 20:50:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:50:00,439 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-18 20:50:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:00,445 INFO L225 Difference]: With dead ends: 922 [2022-11-18 20:50:00,446 INFO L226 Difference]: Without dead ends: 502 [2022-11-18 20:50:00,447 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-18 20:50:00,451 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 68 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:00,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 576 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:50:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-11-18 20:50:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2022-11-18 20:50:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 376 states have (on average 1.3138297872340425) internal successors, (494), 391 states have internal predecessors, (494), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-18 20:50:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 624 transitions. [2022-11-18 20:50:00,510 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 624 transitions. Word has length 80 [2022-11-18 20:50:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:00,514 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 624 transitions. [2022-11-18 20:50:00,515 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-18 20:50:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 624 transitions. [2022-11-18 20:50:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-18 20:50:00,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:00,519 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-18 20:50:00,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:50:00,519 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-18 20:50:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash -254840849, now seen corresponding path program 1 times [2022-11-18 20:50:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:00,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156792023] [2022-11-18 20:50:00,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-18 20:50:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:50:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:00,762 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-18 20:50:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:00,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156792023] [2022-11-18 20:50:00,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156792023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:00,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940670810] [2022-11-18 20:50:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:00,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:00,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:00,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:00,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:50:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:01,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:50:01,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:01,212 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-18 20:50:01,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:01,333 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-18 20:50:01,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940670810] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:50:01,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:50:01,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-18 20:50:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611464278] [2022-11-18 20:50:01,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:01,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:50:01,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:01,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:50:01,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:50:01,336 INFO L87 Difference]: Start difference. First operand 488 states and 624 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-18 20:50:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:02,198 INFO L93 Difference]: Finished difference Result 936 states and 1269 transitions. [2022-11-18 20:50:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:50:02,199 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-18 20:50:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:02,204 INFO L225 Difference]: With dead ends: 936 [2022-11-18 20:50:02,204 INFO L226 Difference]: Without dead ends: 932 [2022-11-18 20:50:02,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:50:02,206 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 343 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:02,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1324 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 20:50:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-18 20:50:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 537. [2022-11-18 20:50:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 420 states have (on average 1.3142857142857143) internal successors, (552), 432 states have internal predecessors, (552), 73 states have call successors, (73), 33 states have call predecessors, (73), 33 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2022-11-18 20:50:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 698 transitions. [2022-11-18 20:50:02,261 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 698 transitions. Word has length 85 [2022-11-18 20:50:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:02,264 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 698 transitions. [2022-11-18 20:50:02,265 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-18 20:50:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 698 transitions. [2022-11-18 20:50:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-18 20:50:02,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:02,268 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:02,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:02,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:02,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-18 20:50:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:02,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1991231195, now seen corresponding path program 1 times [2022-11-18 20:50:02,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:02,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454456114] [2022-11-18 20:50:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:02,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-18 20:50:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:50:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:02,864 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-18 20:50:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:02,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454456114] [2022-11-18 20:50:02,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454456114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:02,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:02,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:50:02,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463163148] [2022-11-18 20:50:02,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:02,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:50:02,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:02,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:50:02,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:50:02,868 INFO L87 Difference]: Start difference. First operand 537 states and 698 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 20:50:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:03,613 INFO L93 Difference]: Finished difference Result 1080 states and 1415 transitions. [2022-11-18 20:50:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:50:03,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-11-18 20:50:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:03,621 INFO L225 Difference]: With dead ends: 1080 [2022-11-18 20:50:03,622 INFO L226 Difference]: Without dead ends: 1078 [2022-11-18 20:50:03,622 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-18 20:50:03,623 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 244 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:03,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 641 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:50:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-11-18 20:50:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1041. [2022-11-18 20:50:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 818 states have (on average 1.3092909535452322) internal successors, (1071), 832 states have internal predecessors, (1071), 146 states have call successors, (146), 66 states have call predecessors, (146), 66 states have return successors, (158), 146 states have call predecessors, (158), 146 states have call successors, (158) [2022-11-18 20:50:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1375 transitions. [2022-11-18 20:50:03,719 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1375 transitions. Word has length 86 [2022-11-18 20:50:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:03,719 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1375 transitions. [2022-11-18 20:50:03,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-18 20:50:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1375 transitions. [2022-11-18 20:50:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-18 20:50:03,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:03,729 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-18 20:50:03,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:50:03,729 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-18 20:50:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:03,730 INFO L85 PathProgramCache]: Analyzing trace with hash 689868528, now seen corresponding path program 1 times [2022-11-18 20:50:03,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:03,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131219311] [2022-11-18 20:50:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:03,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-18 20:50:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:50:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:03,966 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-18 20:50:03,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:03,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131219311] [2022-11-18 20:50:03,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131219311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:03,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856535454] [2022-11-18 20:50:03,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:03,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:03,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:03,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:03,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:50:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:04,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:50:04,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:04,318 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-18 20:50:04,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:50:04,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856535454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:04,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:50:04,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-18 20:50:04,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662874097] [2022-11-18 20:50:04,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:04,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:50:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:50:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:50:04,320 INFO L87 Difference]: Start difference. First operand 1041 states and 1375 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-18 20:50:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:04,657 INFO L93 Difference]: Finished difference Result 2303 states and 3075 transitions. [2022-11-18 20:50:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:50:04,658 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-18 20:50:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:04,665 INFO L225 Difference]: With dead ends: 2303 [2022-11-18 20:50:04,665 INFO L226 Difference]: Without dead ends: 1282 [2022-11-18 20:50:04,668 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-18 20:50:04,671 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 163 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:04,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 546 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:50:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-11-18 20:50:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 930. [2022-11-18 20:50:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 726 states have (on average 1.2768595041322315) internal successors, (927), 737 states have internal predecessors, (927), 130 states have call successors, (130), 66 states have call predecessors, (130), 66 states have return successors, (138), 130 states have call predecessors, (138), 130 states have call successors, (138) [2022-11-18 20:50:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1195 transitions. [2022-11-18 20:50:04,773 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1195 transitions. Word has length 86 [2022-11-18 20:50:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:04,774 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1195 transitions. [2022-11-18 20:50:04,774 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-18 20:50:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1195 transitions. [2022-11-18 20:50:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:50:04,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:04,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:04,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:04,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:04,985 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-18 20:50:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 307828507, now seen corresponding path program 1 times [2022-11-18 20:50:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:04,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765911472] [2022-11-18 20:50:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-18 20:50:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:50:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:50:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,429 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-18 20:50:05,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:05,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765911472] [2022-11-18 20:50:05,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765911472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:05,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17430381] [2022-11-18 20:50:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:05,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:05,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:05,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:05,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:50:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:05,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:50:05,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:06,354 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-18 20:50:06,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:50:06,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17430381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:06,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:50:06,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-11-18 20:50:06,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972755886] [2022-11-18 20:50:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:06,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:50:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:50:06,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:50:06,357 INFO L87 Difference]: Start difference. First operand 930 states and 1195 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-18 20:50:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:06,808 INFO L93 Difference]: Finished difference Result 946 states and 1203 transitions. [2022-11-18 20:50:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:50:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 100 [2022-11-18 20:50:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:06,812 INFO L225 Difference]: With dead ends: 946 [2022-11-18 20:50:06,812 INFO L226 Difference]: Without dead ends: 472 [2022-11-18 20:50:06,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:50:06,814 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 178 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:06,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 290 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:50:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-18 20:50:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-11-18 20:50:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 368 states have (on average 1.2717391304347827) internal successors, (468), 375 states have internal predecessors, (468), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-18 20:50:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 598 transitions. [2022-11-18 20:50:06,865 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 598 transitions. Word has length 100 [2022-11-18 20:50:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:06,866 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 598 transitions. [2022-11-18 20:50:06,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-18 20:50:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 598 transitions. [2022-11-18 20:50:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-18 20:50:06,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:06,869 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-18 20:50:06,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:07,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:50:07,077 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-18 20:50:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2092783693, now seen corresponding path program 1 times [2022-11-18 20:50:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076935296] [2022-11-18 20:50:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:50:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:50:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:50:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:50:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:50:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,322 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-18 20:50:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:07,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076935296] [2022-11-18 20:50:07,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076935296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:07,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:07,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:50:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38483716] [2022-11-18 20:50:07,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:07,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:50:07,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:07,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:50:07,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:50:07,325 INFO L87 Difference]: Start difference. First operand 472 states and 598 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-18 20:50:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:07,756 INFO L93 Difference]: Finished difference Result 766 states and 971 transitions. [2022-11-18 20:50:07,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:50:07,757 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-18 20:50:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:07,760 INFO L225 Difference]: With dead ends: 766 [2022-11-18 20:50:07,760 INFO L226 Difference]: Without dead ends: 490 [2022-11-18 20:50:07,762 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-18 20:50:07,762 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 40 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:07,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 573 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:50:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-18 20:50:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 476. [2022-11-18 20:50:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 371 states have (on average 1.2695417789757413) internal successors, (471), 378 states have internal predecessors, (471), 66 states have call successors, (66), 33 states have call predecessors, (66), 33 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-18 20:50:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 603 transitions. [2022-11-18 20:50:07,812 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 603 transitions. Word has length 105 [2022-11-18 20:50:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:07,812 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 603 transitions. [2022-11-18 20:50:07,813 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-18 20:50:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 603 transitions. [2022-11-18 20:50:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-18 20:50:07,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:07,816 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-18 20:50:07,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:50:07,817 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-18 20:50:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1741438787, now seen corresponding path program 1 times [2022-11-18 20:50:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:07,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495882703] [2022-11-18 20:50:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:50:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:50:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:50:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:50:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:50:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:50:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:50:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,071 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-18 20:50:08,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:08,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495882703] [2022-11-18 20:50:08,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495882703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:08,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316820405] [2022-11-18 20:50:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:08,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:08,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:08,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:08,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:50:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:50:08,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:08,437 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-18 20:50:08,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:08,539 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-18 20:50:08,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316820405] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:50:08,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:50:08,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-18 20:50:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232893745] [2022-11-18 20:50:08,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:08,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:50:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:08,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:50:08,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:50:08,543 INFO L87 Difference]: Start difference. First operand 476 states and 603 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 6 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-18 20:50:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:09,342 INFO L93 Difference]: Finished difference Result 993 states and 1349 transitions. [2022-11-18 20:50:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:50:09,343 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-18 20:50:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:09,348 INFO L225 Difference]: With dead ends: 993 [2022-11-18 20:50:09,349 INFO L226 Difference]: Without dead ends: 992 [2022-11-18 20:50:09,350 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-18 20:50:09,351 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 535 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:09,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1507 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:50:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-18 20:50:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 475. [2022-11-18 20:50:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 371 states have (on average 1.266846361185984) internal successors, (470), 377 states have internal predecessors, (470), 66 states have call successors, (66), 33 states have call predecessors, (66), 33 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-18 20:50:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 602 transitions. [2022-11-18 20:50:09,410 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 602 transitions. Word has length 120 [2022-11-18 20:50:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:09,410 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 602 transitions. [2022-11-18 20:50:09,411 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-18 20:50:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 602 transitions. [2022-11-18 20:50:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-18 20:50:09,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:09,414 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-18 20:50:09,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:09,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:50:09,622 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-18 20:50:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1849972759, now seen corresponding path program 1 times [2022-11-18 20:50:09,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:09,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478702790] [2022-11-18 20:50:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:09,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:50:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:50:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:50:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:50:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:50:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:50:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:50:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:09,945 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-18 20:50:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478702790] [2022-11-18 20:50:09,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478702790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110624752] [2022-11-18 20:50:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:09,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:09,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:09,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:09,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:50:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:10,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:50:10,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:10,375 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-18 20:50:10,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:50:10,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110624752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:10,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:50:10,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-18 20:50:10,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547969279] [2022-11-18 20:50:10,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:10,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:50:10,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:50:10,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:50:10,379 INFO L87 Difference]: Start difference. First operand 475 states and 602 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-18 20:50:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:10,539 INFO L93 Difference]: Finished difference Result 635 states and 830 transitions. [2022-11-18 20:50:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:50:10,540 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-18 20:50:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:10,544 INFO L225 Difference]: With dead ends: 635 [2022-11-18 20:50:10,544 INFO L226 Difference]: Without dead ends: 634 [2022-11-18 20:50:10,545 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-18 20:50:10,546 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 228 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:10,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 585 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:50:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-11-18 20:50:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 471. [2022-11-18 20:50:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 369 states have (on average 1.2655826558265582) internal successors, (467), 374 states have internal predecessors, (467), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-18 20:50:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 597 transitions. [2022-11-18 20:50:10,625 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 597 transitions. Word has length 121 [2022-11-18 20:50:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:10,625 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 597 transitions. [2022-11-18 20:50:10,626 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-18 20:50:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 597 transitions. [2022-11-18 20:50:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-18 20:50:10,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:10,629 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-18 20:50:10,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:10,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:50:10,837 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-18 20:50:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2042279258, now seen corresponding path program 1 times [2022-11-18 20:50:10,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:10,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002658138] [2022-11-18 20:50:10,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:50:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:50:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 20:50:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:50:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:50:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,074 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-18 20:50:11,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:11,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002658138] [2022-11-18 20:50:11,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002658138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:11,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:11,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:50:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437379334] [2022-11-18 20:50:11,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:11,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:50:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:11,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:50:11,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:50:11,078 INFO L87 Difference]: Start difference. First operand 471 states and 597 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-18 20:50:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:11,592 INFO L93 Difference]: Finished difference Result 743 states and 937 transitions. [2022-11-18 20:50:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:50:11,593 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-18 20:50:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:11,596 INFO L225 Difference]: With dead ends: 743 [2022-11-18 20:50:11,596 INFO L226 Difference]: Without dead ends: 468 [2022-11-18 20:50:11,598 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-18 20:50:11,598 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 123 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:11,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 639 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:50:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-18 20:50:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2022-11-18 20:50:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 352 states have (on average 1.25) internal successors, (440), 357 states have internal predecessors, (440), 65 states have call successors, (65), 33 states have call predecessors, (65), 33 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-18 20:50:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 570 transitions. [2022-11-18 20:50:11,649 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 570 transitions. Word has length 114 [2022-11-18 20:50:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:11,650 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 570 transitions. [2022-11-18 20:50:11,650 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-18 20:50:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 570 transitions. [2022-11-18 20:50:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-18 20:50:11,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:11,653 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-18 20:50:11,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:50:11,653 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-18 20:50:11,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -219510499, now seen corresponding path program 1 times [2022-11-18 20:50:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:11,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730459071] [2022-11-18 20:50:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:50:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:50:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:50:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:50:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:50:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:50:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 20:50:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,939 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-18 20:50:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:11,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730459071] [2022-11-18 20:50:11,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730459071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:11,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933798903] [2022-11-18 20:50:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:11,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:11,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:11,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:11,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:50:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:12,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:50:12,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:12,503 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-18 20:50:12,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:12,716 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-18 20:50:12,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933798903] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:50:12,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:50:12,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-11-18 20:50:12,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20867067] [2022-11-18 20:50:12,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:12,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:50:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:12,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:50:12,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:50:12,720 INFO L87 Difference]: Start difference. First operand 454 states and 570 transitions. Second operand has 9 states, 8 states have (on average 25.5) internal successors, (204), 7 states have internal predecessors, (204), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-18 20:50:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:14,506 INFO L93 Difference]: Finished difference Result 1177 states and 1480 transitions. [2022-11-18 20:50:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:50:14,507 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-18 20:50:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:14,513 INFO L225 Difference]: With dead ends: 1177 [2022-11-18 20:50:14,514 INFO L226 Difference]: Without dead ends: 1175 [2022-11-18 20:50:14,515 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-18 20:50:14,516 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 1655 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:14,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 909 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-18 20:50:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-11-18 20:50:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 882. [2022-11-18 20:50:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 683 states have (on average 1.2430453879941434) internal successors, (849), 689 states have internal predecessors, (849), 130 states have call successors, (130), 66 states have call predecessors, (130), 66 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2022-11-18 20:50:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1109 transitions. [2022-11-18 20:50:14,630 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1109 transitions. Word has length 119 [2022-11-18 20:50:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:14,631 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1109 transitions. [2022-11-18 20:50:14,631 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-18 20:50:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1109 transitions. [2022-11-18 20:50:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-18 20:50:14,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:14,634 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-18 20:50:14,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:14,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:14,848 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-18 20:50:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1785109447, now seen corresponding path program 1 times [2022-11-18 20:50:14,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:14,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972246155] [2022-11-18 20:50:14,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:14,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:50:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:50:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-18 20:50:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:50:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-18 20:50:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:50:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-18 20:50:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,068 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-18 20:50:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:15,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972246155] [2022-11-18 20:50:15,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972246155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623785549] [2022-11-18 20:50:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:15,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:15,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:15,071 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:15,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:50:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:15,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:50:15,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:15,632 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-18 20:50:15,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:50:15,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623785549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:15,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:50:15,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-18 20:50:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953965307] [2022-11-18 20:50:15,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:15,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:50:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:15,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:50:15,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:50:15,635 INFO L87 Difference]: Start difference. First operand 882 states and 1109 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 20:50:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:15,950 INFO L93 Difference]: Finished difference Result 1058 states and 1335 transitions. [2022-11-18 20:50:15,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:50:15,951 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-18 20:50:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:15,957 INFO L225 Difference]: With dead ends: 1058 [2022-11-18 20:50:15,958 INFO L226 Difference]: Without dead ends: 1056 [2022-11-18 20:50:15,959 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-18 20:50:15,959 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 320 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:15,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 529 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:50:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-11-18 20:50:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 704. [2022-11-18 20:50:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 546 states have (on average 1.2362637362637363) internal successors, (675), 549 states have internal predecessors, (675), 103 states have call successors, (103), 54 states have call predecessors, (103), 54 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2022-11-18 20:50:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 881 transitions. [2022-11-18 20:50:16,059 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 881 transitions. Word has length 120 [2022-11-18 20:50:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:16,060 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 881 transitions. [2022-11-18 20:50:16,060 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-18 20:50:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 881 transitions. [2022-11-18 20:50:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-11-18 20:50:16,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:16,065 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-18 20:50:16,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:16,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:16,273 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-18 20:50:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1114179813, now seen corresponding path program 2 times [2022-11-18 20:50:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:16,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495994393] [2022-11-18 20:50:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 20:50:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 20:50:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-18 20:50:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:50:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:50:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:50:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:50:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-18 20:50:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:50:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:50:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 20:50:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-18 20:50:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-18 20:50:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:50:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-18 20:50:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:16,560 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-18 20:50:16,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:16,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495994393] [2022-11-18 20:50:16,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495994393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:16,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:16,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:50:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026584230] [2022-11-18 20:50:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:16,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:50:16,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:16,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:50:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:50:16,564 INFO L87 Difference]: Start difference. First operand 704 states and 881 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:50:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:17,008 INFO L93 Difference]: Finished difference Result 961 states and 1199 transitions. [2022-11-18 20:50:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:50:17,009 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-18 20:50:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:17,010 INFO L225 Difference]: With dead ends: 961 [2022-11-18 20:50:17,010 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:50:17,012 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-18 20:50:17,013 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 191 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:17,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 472 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:50:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:50:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:50:17,015 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-18 20:50:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:50:17,015 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 197 [2022-11-18 20:50:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:17,016 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:50:17,016 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-18 20:50:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:50:17,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:50:17,020 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-18 20:50:17,022 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-18 20:50:17,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-18 20:50:17,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-18 20:50:17,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-18 20:50:17,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-18 20:50:17,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-18 20:50:17,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-18 20:50:17,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-18 20:50:17,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-18 20:50:17,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-18 20:50:17,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-18 20:50:17,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-18 20:50:17,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-18 20:50:17,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:50:17,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:50:23,064 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_rawENTRY(lines 938 943) the Hoare annotation is: true [2022-11-18 20:50:23,065 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 938 943) no Hoare annotation was computed. [2022-11-18 20:50:23,065 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 938 943) no Hoare annotation was computed. [2022-11-18 20:50:23,065 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-18 20:50:23,065 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-18 20:50:23,066 INFO L899 garLoopResultBuilder]: For program point L1407-1(line 1407) no Hoare annotation was computed. [2022-11-18 20:50:23,066 INFO L902 garLoopResultBuilder]: At program point L1407-2(lines 1406 1408) the Hoare annotation is: true [2022-11-18 20:50:23,066 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 893 900) no Hoare annotation was computed. [2022-11-18 20:50:23,066 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 893 900) no Hoare annotation was computed. [2022-11-18 20:50:23,066 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-18 20:50:23,066 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-18 20:50:23,066 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-18 20:50:23,067 INFO L895 garLoopResultBuilder]: At program point L845(lines 840 847) the Hoare annotation is: (or (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_state_variable_0~0 3)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-11-18 20:50:23,067 INFO L902 garLoopResultBuilder]: At program point L1385(line 1385) the Hoare annotation is: true [2022-11-18 20:50:23,067 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_file_dev_attr_of_sensor_device_attributeENTRY(lines 1376 1392) the Hoare annotation is: (or (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_state_variable_1~0 1)) (not (= ~ldv_state_variable_0~0 3)) (= ~ldv_count_2~0 0) (not (<= ~ldv_count_1~0 0))) [2022-11-18 20:50:23,067 INFO L899 garLoopResultBuilder]: For program point L1383(lines 1383 1386) no Hoare annotation was computed. [2022-11-18 20:50:23,067 INFO L899 garLoopResultBuilder]: For program point L1381(line 1381) no Hoare annotation was computed. [2022-11-18 20:50:23,067 INFO L899 garLoopResultBuilder]: For program point L1380(lines 1380 1388) no Hoare annotation was computed. [2022-11-18 20:50:23,067 INFO L899 garLoopResultBuilder]: For program point L1381-1(line 1381) no Hoare annotation was computed. [2022-11-18 20:50:23,067 INFO L899 garLoopResultBuilder]: For program point L1380-1(lines 1380 1388) no Hoare annotation was computed. [2022-11-18 20:50:23,067 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-18 20:50:23,068 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1426 1428) no Hoare annotation was computed. [2022-11-18 20:50:23,068 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 1426 1428) the Hoare annotation is: true [2022-11-18 20:50:23,068 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1426 1428) no Hoare annotation was computed. [2022-11-18 20:50:23,068 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 856 862) no Hoare annotation was computed. [2022-11-18 20:50:23,068 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 856 862) the Hoare annotation is: true [2022-11-18 20:50:23,068 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 856 862) no Hoare annotation was computed. [2022-11-18 20:50:23,068 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 863 869) no Hoare annotation was computed. [2022-11-18 20:50:23,068 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 863 869) the Hoare annotation is: true [2022-11-18 20:50:23,068 INFO L902 garLoopResultBuilder]: At program point s3c_adc_releaseENTRY(lines 1453 1455) the Hoare annotation is: true [2022-11-18 20:50:23,069 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1453 1455) no Hoare annotation was computed. [2022-11-18 20:50:23,069 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1453 1455) no Hoare annotation was computed. [2022-11-18 20:50:23,069 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-11-18 20:50:23,069 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-11-18 20:50:23,069 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 800 802) the Hoare annotation is: true [2022-11-18 20:50:23,069 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-11-18 20:50:23,069 INFO L902 garLoopResultBuilder]: At program point L1345(lines 1342 1347) the Hoare annotation is: true [2022-11-18 20:50:23,069 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1290 1297) no Hoare annotation was computed. [2022-11-18 20:50:23,069 INFO L902 garLoopResultBuilder]: At program point PTR_ERRENTRY(lines 1290 1297) the Hoare annotation is: true [2022-11-18 20:50:23,070 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1290 1297) no Hoare annotation was computed. [2022-11-18 20:50:23,070 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1330 1335) no Hoare annotation was computed. [2022-11-18 20:50:23,070 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 1330 1335) the Hoare annotation is: true [2022-11-18 20:50:23,070 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1330 1335) no Hoare annotation was computed. [2022-11-18 20:50:23,070 INFO L899 garLoopResultBuilder]: For program point L817(line 817) no Hoare annotation was computed. [2022-11-18 20:50:23,070 INFO L902 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: true [2022-11-18 20:50:23,070 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-11-18 20:50:23,070 INFO L902 garLoopResultBuilder]: At program point L816-1(line 816) the Hoare annotation is: true [2022-11-18 20:50:23,070 INFO L899 garLoopResultBuilder]: For program point L817-2(line 817) no Hoare annotation was computed. [2022-11-18 20:50:23,071 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-18 20:50:23,071 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 819) no Hoare annotation was computed. [2022-11-18 20:50:23,071 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 804 821) no Hoare annotation was computed. [2022-11-18 20:50:23,071 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 804 821) no Hoare annotation was computed. [2022-11-18 20:50:23,071 INFO L902 garLoopResultBuilder]: At program point L834-1(line 834) the Hoare annotation is: true [2022-11-18 20:50:23,071 INFO L899 garLoopResultBuilder]: For program point L835-2(line 835) no Hoare annotation was computed. [2022-11-18 20:50:23,071 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:50:23,071 INFO L899 garLoopResultBuilder]: For program point L829(lines 829 837) no Hoare annotation was computed. [2022-11-18 20:50:23,084 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 822 839) no Hoare annotation was computed. [2022-11-18 20:50:23,085 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-18 20:50:23,085 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 822 839) no Hoare annotation was computed. [2022-11-18 20:50:23,085 INFO L899 garLoopResultBuilder]: For program point L835(line 835) no Hoare annotation was computed. [2022-11-18 20:50:23,085 INFO L902 garLoopResultBuilder]: At program point L834(line 834) the Hoare annotation is: true [2022-11-18 20:50:23,086 INFO L902 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: true [2022-11-18 20:50:23,086 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1420 1422) no Hoare annotation was computed. [2022-11-18 20:50:23,087 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 1420 1422) the Hoare annotation is: true [2022-11-18 20:50:23,087 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1420 1422) no Hoare annotation was computed. [2022-11-18 20:50:23,088 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-18 20:50:23,088 INFO L902 garLoopResultBuilder]: At program point L1274(line 1274) the Hoare annotation is: true [2022-11-18 20:50:23,088 INFO L899 garLoopResultBuilder]: For program point L1159(line 1159) no Hoare annotation was computed. [2022-11-18 20:50:23,088 INFO L895 garLoopResultBuilder]: At program point L1027(lines 994 1029) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-11-18 20:50:23,088 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:50:23,089 INFO L895 garLoopResultBuilder]: At program point L1143(lines 1038 1145) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,089 INFO L899 garLoopResultBuilder]: For program point L1457(lines 1457 1459) no Hoare annotation was computed. [2022-11-18 20:50:23,089 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-18 20:50:23,089 INFO L899 garLoopResultBuilder]: For program point L1424-1(line 1424) no Hoare annotation was computed. [2022-11-18 20:50:23,090 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-18 20:50:23,090 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1264) no Hoare annotation was computed. [2022-11-18 20:50:23,090 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1159) no Hoare annotation was computed. [2022-11-18 20:50:23,090 INFO L899 garLoopResultBuilder]: For program point L1259-2(lines 1257 1270) no Hoare annotation was computed. [2022-11-18 20:50:23,090 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-18 20:50:23,091 INFO L895 garLoopResultBuilder]: At program point L1127(lines 1051 1144) the Hoare annotation is: (and (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ldv_count_2~0 0))) (or (and (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse0 .cse1) (and .cse0 (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse1))) (<= ~ldv_count_1~0 0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,091 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2022-11-18 20:50:23,092 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-18 20:50:23,092 INFO L899 garLoopResultBuilder]: For program point L1111(lines 1111 1126) no Hoare annotation was computed. [2022-11-18 20:50:23,092 INFO L899 garLoopResultBuilder]: For program point L1078(lines 1078 1081) no Hoare annotation was computed. [2022-11-18 20:50:23,092 INFO L899 garLoopResultBuilder]: For program point L1012(lines 1012 1026) no Hoare annotation was computed. [2022-11-18 20:50:23,092 INFO L899 garLoopResultBuilder]: For program point L1012-1(lines 1012 1026) no Hoare annotation was computed. [2022-11-18 20:50:23,092 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-18 20:50:23,093 INFO L899 garLoopResultBuilder]: For program point L1326-1(line 1326) no Hoare annotation was computed. [2022-11-18 20:50:23,093 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1159) no Hoare annotation was computed. [2022-11-18 20:50:23,093 INFO L899 garLoopResultBuilder]: For program point L1128(line 1128) no Hoare annotation was computed. [2022-11-18 20:50:23,094 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1095 1098) no Hoare annotation was computed. [2022-11-18 20:50:23,094 INFO L895 garLoopResultBuilder]: At program point L1310(line 1310) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-11-18 20:50:23,094 INFO L899 garLoopResultBuilder]: For program point L1310-1(line 1310) no Hoare annotation was computed. [2022-11-18 20:50:23,095 INFO L899 garLoopResultBuilder]: For program point L1244(line 1244) no Hoare annotation was computed. [2022-11-18 20:50:23,095 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-18 20:50:23,095 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-18 20:50:23,096 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-18 20:50:23,096 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-18 20:50:23,096 INFO L895 garLoopResultBuilder]: At program point L1311(lines 1306 1313) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-11-18 20:50:23,097 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1278) no Hoare annotation was computed. [2022-11-18 20:50:23,097 INFO L899 garLoopResultBuilder]: For program point L1229(line 1229) no Hoare annotation was computed. [2022-11-18 20:50:23,097 INFO L895 garLoopResultBuilder]: At program point L1196(line 1196) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,098 INFO L899 garLoopResultBuilder]: For program point L1196-1(line 1196) no Hoare annotation was computed. [2022-11-18 20:50:23,098 INFO L902 garLoopResultBuilder]: At program point L1444(lines 1443 1445) the Hoare annotation is: true [2022-11-18 20:50:23,098 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1282) no Hoare annotation was computed. [2022-11-18 20:50:23,098 INFO L899 garLoopResultBuilder]: For program point L1114(line 1114) no Hoare annotation was computed. [2022-11-18 20:50:23,099 INFO L899 garLoopResultBuilder]: For program point L1114-1(line 1114) no Hoare annotation was computed. [2022-11-18 20:50:23,099 INFO L899 garLoopResultBuilder]: For program point L1230(lines 1230 1235) no Hoare annotation was computed. [2022-11-18 20:50:23,099 INFO L895 garLoopResultBuilder]: At program point L1131(lines 1051 1144) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-11-18 20:50:23,099 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:50:23,100 INFO L899 garLoopResultBuilder]: For program point L1280(line 1280) no Hoare annotation was computed. [2022-11-18 20:50:23,100 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1275) no Hoare annotation was computed. [2022-11-18 20:50:23,100 INFO L899 garLoopResultBuilder]: For program point L1214(line 1214) no Hoare annotation was computed. [2022-11-18 20:50:23,100 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-18 20:50:23,100 INFO L895 garLoopResultBuilder]: At program point L1198(lines 1192 1200) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,101 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-18 20:50:23,101 INFO L899 garLoopResultBuilder]: For program point L1165-1(line 1165) no Hoare annotation was computed. [2022-11-18 20:50:23,101 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1103) no Hoare annotation was computed. [2022-11-18 20:50:23,101 INFO L899 garLoopResultBuilder]: For program point L1099-2(lines 1099 1103) no Hoare annotation was computed. [2022-11-18 20:50:23,101 INFO L902 garLoopResultBuilder]: At program point L1281(line 1281) the Hoare annotation is: true [2022-11-18 20:50:23,102 INFO L899 garLoopResultBuilder]: For program point L1248(line 1248) no Hoare annotation was computed. [2022-11-18 20:50:23,102 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1242) no Hoare annotation was computed. [2022-11-18 20:50:23,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-18 20:50:23,102 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-18 20:50:23,104 INFO L899 garLoopResultBuilder]: For program point L1083-1(line 1083) no Hoare annotation was computed. [2022-11-18 20:50:23,105 INFO L902 garLoopResultBuilder]: At program point L1430(lines 1429 1431) the Hoare annotation is: true [2022-11-18 20:50:23,105 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-18 20:50:23,105 INFO L899 garLoopResultBuilder]: For program point L1166-1(line 1166) no Hoare annotation was computed. [2022-11-18 20:50:23,108 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1223) no Hoare annotation was computed. [2022-11-18 20:50:23,108 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-18 20:50:23,108 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-18 20:50:23,109 INFO L899 garLoopResultBuilder]: For program point L1249(lines 1249 1254) no Hoare annotation was computed. [2022-11-18 20:50:23,109 INFO L899 garLoopResultBuilder]: For program point L1117(line 1117) no Hoare annotation was computed. [2022-11-18 20:50:23,109 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1090) no Hoare annotation was computed. [2022-11-18 20:50:23,109 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-11-18 20:50:23,109 INFO L899 garLoopResultBuilder]: For program point L1233-1(line 1233) no Hoare annotation was computed. [2022-11-18 20:50:23,110 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-18 20:50:23,110 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1223) no Hoare annotation was computed. [2022-11-18 20:50:23,110 INFO L895 garLoopResultBuilder]: At program point L1283(lines 1206 1288) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 0)) (.cse0 (<= ~ldv_count_1~0 0)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= ~ldv_state_variable_1~0 0) .cse1 .cse2) (and .cse0 (= ~ldv_state_variable_1~0 1) .cse1 .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse2 .cse3 (<= ~ref_cnt~0 1)))) [2022-11-18 20:50:23,110 INFO L899 garLoopResultBuilder]: For program point L1217(lines 1217 1239) no Hoare annotation was computed. [2022-11-18 20:50:23,111 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1114) no Hoare annotation was computed. [2022-11-18 20:50:23,111 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-11-18 20:50:23,111 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:50:23,111 INFO L902 garLoopResultBuilder]: At program point L1267(lines 1206 1288) the Hoare annotation is: true [2022-11-18 20:50:23,111 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-18 20:50:23,112 INFO L899 garLoopResultBuilder]: For program point L1069-1(line 1069) no Hoare annotation was computed. [2022-11-18 20:50:23,113 INFO L899 garLoopResultBuilder]: For program point L1218(line 1218) no Hoare annotation was computed. [2022-11-18 20:50:23,114 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1114) no Hoare annotation was computed. [2022-11-18 20:50:23,114 INFO L902 garLoopResultBuilder]: At program point L1185(lines 1181 1187) the Hoare annotation is: true [2022-11-18 20:50:23,114 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-18 20:50:23,114 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-18 20:50:23,114 INFO L899 garLoopResultBuilder]: For program point L1152-1(line 1152) no Hoare annotation was computed. [2022-11-18 20:50:23,115 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-18 20:50:23,115 INFO L899 garLoopResultBuilder]: For program point L1086-1(line 1086) no Hoare annotation was computed. [2022-11-18 20:50:23,115 INFO L899 garLoopResultBuilder]: For program point L1020(lines 1020 1024) no Hoare annotation was computed. [2022-11-18 20:50:23,115 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-18 20:50:23,116 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-18 20:50:23,116 INFO L899 garLoopResultBuilder]: For program point L1136-1(line 1136) no Hoare annotation was computed. [2022-11-18 20:50:23,116 INFO L899 garLoopResultBuilder]: For program point L1070(lines 1070 1076) no Hoare annotation was computed. [2022-11-18 20:50:23,116 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-18 20:50:23,116 INFO L895 garLoopResultBuilder]: At program point L1318(line 1318) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-11-18 20:50:23,117 INFO L899 garLoopResultBuilder]: For program point L1318-1(line 1318) no Hoare annotation was computed. [2022-11-18 20:50:23,117 INFO L899 garLoopResultBuilder]: For program point L1219(lines 1219 1227) no Hoare annotation was computed. [2022-11-18 20:50:23,117 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1058) no Hoare annotation was computed. [2022-11-18 20:50:23,117 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-11-18 20:50:23,117 INFO L899 garLoopResultBuilder]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2022-11-18 20:50:23,118 INFO L895 garLoopResultBuilder]: At program point L1137(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,119 INFO L899 garLoopResultBuilder]: For program point L1104(lines 1104 1108) no Hoare annotation was computed. [2022-11-18 20:50:23,119 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-18 20:50:23,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1233) no Hoare annotation was computed. [2022-11-18 20:50:23,119 INFO L899 garLoopResultBuilder]: For program point L1451-1(line 1451) no Hoare annotation was computed. [2022-11-18 20:50:23,120 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-18 20:50:23,120 INFO L895 garLoopResultBuilder]: At program point L1319(lines 1314 1321) the Hoare annotation is: (let ((.cse0 (<= ~ldv_count_1~0 0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_count_2~0 0)) (.cse3 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) .cse2 .cse3) (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 0) .cse1 .cse2 .cse3))) [2022-11-18 20:50:23,121 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-18 20:50:23,121 INFO L895 garLoopResultBuilder]: At program point L1121(lines 1111 1125) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (<= 0 |ULTIMATE.start_s3c_hwmon_probe_~i~0#1|) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (< |ULTIMATE.start_s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,121 INFO L899 garLoopResultBuilder]: For program point L1154-1(line 1154) no Hoare annotation was computed. [2022-11-18 20:50:23,122 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-11-18 20:50:23,122 INFO L895 garLoopResultBuilder]: At program point L1138(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,122 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-18 20:50:23,122 INFO L899 garLoopResultBuilder]: For program point L1072-1(line 1072) no Hoare annotation was computed. [2022-11-18 20:50:23,122 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1233) no Hoare annotation was computed. [2022-11-18 20:50:23,123 INFO L902 garLoopResultBuilder]: At program point L1287(lines 1201 1289) the Hoare annotation is: true [2022-11-18 20:50:23,123 INFO L899 garLoopResultBuilder]: For program point L1221(lines 1221 1225) no Hoare annotation was computed. [2022-11-18 20:50:23,123 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:50:23,123 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1128) no Hoare annotation was computed. [2022-11-18 20:50:23,123 INFO L902 garLoopResultBuilder]: At program point L1238(line 1238) the Hoare annotation is: true [2022-11-18 20:50:23,124 INFO L899 garLoopResultBuilder]: For program point L1007(lines 1007 1011) no Hoare annotation was computed. [2022-11-18 20:50:23,124 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1128) no Hoare annotation was computed. [2022-11-18 20:50:23,124 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,124 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-11-18 20:50:23,124 INFO L899 garLoopResultBuilder]: For program point L1256(line 1256) no Hoare annotation was computed. [2022-11-18 20:50:23,125 INFO L899 garLoopResultBuilder]: For program point L1223(line 1223) no Hoare annotation was computed. [2022-11-18 20:50:23,125 INFO L899 garLoopResultBuilder]: For program point L1223-1(line 1223) no Hoare annotation was computed. [2022-11-18 20:50:23,125 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-18 20:50:23,125 INFO L899 garLoopResultBuilder]: For program point L1273(line 1273) no Hoare annotation was computed. [2022-11-18 20:50:23,125 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1051 1144) the Hoare annotation is: (and (<= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0) (= ~ldv_state_variable_0~0 3)) [2022-11-18 20:50:23,126 INFO L899 garLoopResultBuilder]: For program point L1257(lines 1257 1271) no Hoare annotation was computed. [2022-11-18 20:50:23,126 INFO L899 garLoopResultBuilder]: For program point L1158(line 1158) no Hoare annotation was computed. [2022-11-18 20:50:23,126 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1030 1037) no Hoare annotation was computed. [2022-11-18 20:50:23,126 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_attrENTRY(lines 1030 1037) the Hoare annotation is: true [2022-11-18 20:50:23,126 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1030 1037) no Hoare annotation was computed. [2022-11-18 20:50:23,126 INFO L902 garLoopResultBuilder]: At program point L1033(line 1033) the Hoare annotation is: true [2022-11-18 20:50:23,127 INFO L902 garLoopResultBuilder]: At program point L1033-1(line 1033) the Hoare annotation is: true [2022-11-18 20:50:23,127 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 1298 1305) the Hoare annotation is: true [2022-11-18 20:50:23,128 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1298 1305) no Hoare annotation was computed. [2022-11-18 20:50:23,128 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1298 1305) no Hoare annotation was computed. [2022-11-18 20:50:23,128 INFO L902 garLoopResultBuilder]: At program point L1302(line 1302) the Hoare annotation is: true [2022-11-18 20:50:23,128 INFO L899 garLoopResultBuilder]: For program point L1302-1(line 1302) no Hoare annotation was computed. [2022-11-18 20:50:23,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-18 20:50:23,138 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:50:23,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:50:23 BoogieIcfgContainer [2022-11-18 20:50:23,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:50:23,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:50:23,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:50:23,196 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:50:23,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:54" (3/4) ... [2022-11-18 20:50:23,199 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:50:23,208 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2022-11-18 20:50:23,208 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2022-11-18 20:50:23,208 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-11-18 20:50:23,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-18 20:50:23,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2022-11-18 20:50:23,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2022-11-18 20:50:23,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2022-11-18 20:50:23,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-18 20:50:23,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-18 20:50:23,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-11-18 20:50:23,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2022-11-18 20:50:23,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-18 20:50:23,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2022-11-18 20:50:23,211 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2022-11-18 20:50:23,211 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2022-11-18 20:50:23,235 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2022-11-18 20:50:23,236 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2022-11-18 20:50:23,237 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-18 20:50:23,238 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 20:50:23,239 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:50:23,240 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:50:23,291 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ref_cnt == 0) || !(\old(ldv_count_2) == 0)) || !(ldv_state_variable_1 == 1)) || !(ldv_state_variable_0 == 3)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) [2022-11-18 20:50:23,385 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:50:23,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:50:23,389 INFO L158 Benchmark]: Toolchain (without parser) took 31527.66ms. Allocated memory was 115.3MB in the beginning and 398.5MB in the end (delta: 283.1MB). Free memory was 85.7MB in the beginning and 148.5MB in the end (delta: -62.8MB). Peak memory consumption was 219.5MB. Max. memory is 16.1GB. [2022-11-18 20:50:23,390 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 115.3MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:50:23,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 994.54ms. Allocated memory is still 115.3MB. Free memory was 85.7MB in the beginning and 72.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:50:23,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.47ms. Allocated memory is still 115.3MB. Free memory was 72.3MB in the beginning and 68.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:50:23,392 INFO L158 Benchmark]: Boogie Preprocessor took 60.41ms. Allocated memory is still 115.3MB. Free memory was 68.1MB in the beginning and 64.3MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:50:23,392 INFO L158 Benchmark]: RCFGBuilder took 1370.08ms. Allocated memory was 115.3MB in the beginning and 172.0MB in the end (delta: 56.6MB). Free memory was 64.3MB in the beginning and 116.4MB in the end (delta: -52.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-11-18 20:50:23,393 INFO L158 Benchmark]: TraceAbstraction took 28769.44ms. Allocated memory was 172.0MB in the beginning and 398.5MB in the end (delta: 226.5MB). Free memory was 115.7MB in the beginning and 159.0MB in the end (delta: -43.3MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. [2022-11-18 20:50:23,394 INFO L158 Benchmark]: Witness Printer took 190.60ms. Allocated memory is still 398.5MB. Free memory was 159.0MB in the beginning and 148.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:50:23,400 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.34ms. Allocated memory is still 115.3MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 994.54ms. Allocated memory is still 115.3MB. Free memory was 85.7MB in the beginning and 72.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.47ms. Allocated memory is still 115.3MB. Free memory was 72.3MB in the beginning and 68.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.41ms. Allocated memory is still 115.3MB. Free memory was 68.1MB in the beginning and 64.3MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1370.08ms. Allocated memory was 115.3MB in the beginning and 172.0MB in the end (delta: 56.6MB). Free memory was 64.3MB in the beginning and 116.4MB in the end (delta: -52.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28769.44ms. Allocated memory was 172.0MB in the beginning and 398.5MB in the end (delta: 226.5MB). Free memory was 115.7MB in the beginning and 159.0MB in the end (delta: -43.3MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. * Witness Printer took 190.60ms. Allocated memory is still 398.5MB. Free memory was 159.0MB in the beginning and 148.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. 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, 208 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 28.6s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5595 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5202 mSDsluCounter, 11883 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7509 mSDsCounter, 1363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4477 IncrementalHoareTripleChecker+Invalid, 5840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1363 mSolverCounterUnsat, 4374 mSDtfsCounter, 4477 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1462 GetRequests, 1371 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1041occurred in iteration=8, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 2622 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 1229 PreInvPairs, 1341 NumberOfFragments, 1386 HoareAnnotationTreeSize, 1229 FomulaSimplifications, 4903 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 82 FomulaSimplificationsInter, 12804 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2289 NumberOfCodeBlocks, 2289 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2586 ConstructedInterpolants, 0 QuantifiedInterpolants, 5049 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5704 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 785/845 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: (((((ldv_count_1 <= 0 && 0 <= i) && ldv_state_variable_1 == 1) && ref_cnt == 0) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1146]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && i <= 2147483646) && 1 <= i) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 1342]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((i == 0 && ldv_state_variable_1 == 1) && ldv_count_2 == 0) || (((ldv_state_variable_1 == 1 && 1 <= i) && i < 2147483646) && ldv_count_2 == 0)) && ldv_count_1 <= 0) && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1443]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1306]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: (((ldv_state_variable_1 == 2 && 1 <= ref_cnt) && ((((ldv_count_1 <= 0 && i < 2147483646) && 1 <= i) && ldv_count_2 == 0) || ((ldv_count_1 <= 0 && i == 0) && ldv_count_2 == 0))) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 1413]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || (((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i <= 2147483646) && ldv_state_variable_1 == 1) && 1 <= i) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1450]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1173]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 863]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1440]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1429]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1406]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1181]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 994]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && i <= 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0) || ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3)) || (((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 1322]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1192]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && i == 0) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 2) && i <= 2147483646) && 1 <= i) && 1 <= ref_cnt) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 1423]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: ((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: ((((((ldv_count_1 <= 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && 1 <= i) && i < 2147483646) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) || ((((((ldv_count_1 <= 0 && ref_cnt <= 0) && 0 <= ref_cnt) && i == 0) && ldv_state_variable_1 == 1) && ldv_count_2 == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 1201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1393]: Loop Invariant Derived loop invariant: ((ldv_count_1 <= 0 && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 840]: Loop Invariant Derived loop invariant: ((((!(ref_cnt == 0) || !(\old(ldv_count_2) == 0)) || !(ldv_state_variable_1 == 1)) || !(ldv_state_variable_0 == 3)) || ldv_count_2 == 0) || !(ldv_count_1 <= 0) RESULT: Ultimate proved your program to be correct! [2022-11-18 20:50:23,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e9169a0-8b3c-459b-8fd6-c81a3312397e/bin/uautomizer-TMbwUNV5ro/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